An optimal algorithm for reporting visible rectangles
نویسندگان
چکیده
We consider the following problem as defined by Grove et al. [5]: Given a set of n isothetic rectangles in 3D space determine the subset of rectangles that are not completely hidden. We present an optimal algorithm for this problem that runs in O(nlogn) time and O(n) storage. Our result is an improvement over the one of Grove et al. by a logarithmic factor in storage and is achieved by using a different approach. An analogous approach solves the problem for other kinds of objects too. Key-words: Computer Graphics, 3D space, hidden surface removal, object space algorithms. CSCC'99 Proc.pp.2231-2236
منابع مشابه
A Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars
Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...
متن کاملA Space-Optimal Hidden Surface Removal Algorithm for Iso-Oriented Rectangles
We investigate the problem of finding the visible pieces of a scene of objects from a specified viewpoint. In particular, we are interested in the design of an efficient hidden surface removal algorithm for a scene comprised of iso-oriented rectangles. We propose an algorithm where given a set of n iso-oriented rectangles we report all visible surfaces in O((n+ k) log n) time and linear space, ...
متن کاملStabbing Segments with Rectilinear Objects
Given a set S of n line segments in the plane, we say that a region R ⊆ R is a stabber for S ifR contains exactly one endpoint of each segment of S. In this paper we provide optimal or near-optimal algorithms for reporting all combinatorially different stabbers for several shapes of stabbers. Specifically, we consider the case in which the stabber can be described as the intersection of axis-pa...
متن کاملA new metaheuristic genetic-based placement algorithm for 2D strip packing
Given a container of fixed width, infinite height and a set of rectangular block, the 2D-strip packing problem consists of orthogonally placing all the rectangles such that the height is minimized. The position is subject to confinement of no overlapping of blocks. The problem is a complex NP-hard combinatorial optimization, thus a heuristic based on genetic algorithm is proposed to solve it. I...
متن کاملAn Optimal Algorithm for Approximating a Set of Rectangles by Two Minimum Area Rectangles
In this paper we face the problem of computing a conservative approximation of a set of isothetic rectangles in the plane by means of a pair of enclosing isothetic rectangles. We propose an O(n log n) time algorithm for nding, given a set M of n isothetic rectangles, a pair of isothetic rectangles (s; t) such that s and t enclose all rectangles of M and area(s) + area(t) is minimal. Moreover we...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 81 شماره
صفحات -
تاریخ انتشار 2002